A Smart Contract System for Decentralized Borda Count Voting
نویسندگان
چکیده
منابع مشابه
The Borda Count and Dominance Solvable Voting Games
We analyse dominance solvability (by iterated elimination of weakly dominated strategies) of voting games with three candidates and provide sufficient and necessary conditions for the Borda Count to yield a unique winner. We find that Borda is the unique scoring rule that is dominance solvable both (i) under unanimous agreement on a best candidate and (ii) under unanimous agreement on a worst c...
متن کاملA Smart Contract for Boardroom Voting with Maximum Voter Privacy
We present the first implementation of a decentralised and self-tallying internet voting protocol with maximum voter privacy using the Blockchain. The Open Vote Network is suitable for boardroom elections and is written as a smart contract for Ethereum. Unlike previously proposed Blockchain e-voting protocols, this is the first implementation that does not rely on any trusted authority to compu...
متن کاملA Borda count for partially ordered ballots
The application of the theory of partially ordered sets to voting systems is an important development in the mathematical theory of elections. Many of the results in this area are on the comparative properties between traditional elections with linearly ordered ballots and those with partially ordered ballots. In this paper we present a scoring procedure, called the partial Borda count, that ex...
متن کاملProbabilistic Borda rule voting
An alternative voting system, referred to as probabilistic Borda rule, is developed and analyzed. The winning alternative under this system is chosen by lottery where the weights are determined from each alternative’s Borda score relative to all Borda points possible. Advantages of the lottery include the elimination of strategic voting on the set of alternatives under consideration and breakin...
متن کاملNon-manipulable domains for the Borda count
We characterize the preference domains on which the Borda count satisfies Arrow’s “independence of irrelevant alternatives” condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (“Condorcet cycles”). We then ask on which domains the Borda count is non-manipulable. It turns out that it is non-manipulable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Engineering Management
سال: 2020
ISSN: 0018-9391,1558-0040
DOI: 10.1109/tem.2020.2986371